An algebraic construction of predicate transformers
نویسندگان
چکیده
منابع مشابه
An Algebraic Construction of Predicate Transformers
In this paper we present an algebraic construction of monotonic predicate transformers, using a categorical construction which is similar to the algebraic construction of the integers from the natural numbers. When applied to the category of sets and total functions once, it yields a category isomorphic to the category of sets and relations; a second application yields a category isomorphic to ...
متن کاملA Relation-Algebraic Approach to Multirelations and Predicate Transformers
The correspondence between up-closed multirelations and isotone predicate transformers is well known. Less known is that multirelations have also been used for modelling topological contact, not only computations. We investigate how properties from these two lines of research translate to predicate transformers. To this end, we express the correspondence of multirelations and predicate transfor...
متن کاملUnderapproximating Predicate Transformers
We study the underapproximation of the predicate transformers used to give semantics to the modalities in dynamic and temporal logic. Because predicate transformers operate on state sets, we define appropriate powerdomains for sound approximation. We study four such domains — two are based on “set inclusion” approximation, and two are based on “quantification” approximation — and we apply the d...
متن کاملPredicate Transformers for Convex Powerdomains
We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to convex powerdomains, the appropriate powerdomains for the combin...
متن کاملHealthiness Conditions for Predicate Transformers
The behavior of a program can be modeled by describing how it transforms input states to output states, the state transformer semantics. Alternatively, for verification purposes one is interested in a ’predicate transformer semantics’ which, for every condition on the output, yields the weakest precondition on the input that guarantees the desired property for the output. In the presence of com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1994
ISSN: 0167-6423
DOI: 10.1016/0167-6423(94)90006-x